منابع مشابه
A Hybrid Predicate Calculus∗
We present the Hybrid Predicate Calculus (HPC), a hybrid logical system which incorporates a fairly conventional first-order predicate calculus, but which also include elements of modal logic and relational algebra. A special effort has been made to produce a (syntactically and semantically) well-integrated whole, rather than just a disjoint union. Our calculus, from a formal point of view, is ...
متن کاملThe predicate calculus is complete∗
The first thing we need to do is to precisify the inference rules UI and EE. To this end, we will use A(c) to denote a sentence containing the name c, and we will use ∀vA(v) to denote the sentence that results from replacing all occurrences of c in A(c) with v and then putting the quantifier ∀v on the front. (We also require that the variable v did not already occur in A(c).) We use a similar c...
متن کاملA Description Classifier for the Predicate Calculus
A description classifier organizes concepts and relations into a taxonomy based on the results of subsumption computations applied to pairs of relation definitions. Until now, description classifiers have only been designed to operate over definitions phrased in highly restricted subsets of the predicate calculus. This paper describes a classifier able to reason with definitions phrased in the ...
متن کاملNotes on Predicate Calculus and Logic Programming
[1] Apt, K. R.: Logic Programming, Handbook of Theoretical Computer Science (J. van Leeuwen, ed.), Elsevier Science Publishers B.V., 1990. [2] Chang, C.-L. and Lee, R. C.-T.: Symbolic Logic and Mechanical Theorem Proving, Academic Press Inc., 1973. [3] Kowalski, R.: Logic for Problem Solving, North Holland, 1979. [4] Lloyd, J. W.: Foundations of Logic Programming, 2nd Edition, Springer Verlag, ...
متن کاملPredicate Abstraction in a Program Logic Calculus
Predicate abstraction is a form of abstract interpretation where the abstract domain is constructed from a finite set of predicates over the variables of the program. This paper explores a way to integrate predicate abstraction into a calculus for deductive program verification based on symbolic execution, where it allows us to infer loop invariants automatically that would otherwise have to be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1998
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1039293019